M/g/fq: Stochastic Analysis of Fair Queueing Systems
نویسنده
چکیده
Fair scheduling or Fair Queueing (FQ) algorithms have received much attention in recent years because of their ability to provide a wide range of Quality-ofService (QoS) guarantees to end users. In this paper, we present a new analysis method that can statistically model such fair scheduling algorithms under Poisson arrivals and a general packet length distribution. We coin the new term M/G/FQ to describe this analysis method, which fits a broad range of scheduling policies including WFQ, SCFQ, SFQ and SPFQ.
منابع مشابه
Stochastic Bounds on Delays of Fair Queueing Algorithms
In this paper we study the delay characteristics of Fair Queueing algorithms with a stochastic comparison approach. In integrated services networks, Fair Queueing (FQ) algorithms have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traac is bounded, and they ensure the fair allocation of the bandwidth. The delay characteri...
متن کاملDelay Analysis of Fair Queueing Algorithms with theStochastic Comparison Approach
The delay characteristics of leaky-bucket constrained sources under Fair Queueing (FQ) policies are evaluated through the worst-case delay bounds. Clearly, these deterministic bounds do not always provide an insight into the underlying system. Moreover, with general stochas-tic source models, there is no analytical method to analyze the delay characteristics. We propose to apply the stochastic ...
متن کاملComparison of Fair Queuing Algorithms with a Stochastic Approach
In this paper we compare fair queueing algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions. In this way, we try to give a better insight into the performance of a Fair Queueing policy than what worst-case measures can provide. As an application of this approach, we...
متن کاملEmergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملAn Approximate Analysis of Two Class WFQ Systems
The class based weighted fair queueing (WFQ) is applied in a lot of computer and communication systems. It is a popular way to share a common resource. Its efficient analytical solution is an open question for a long time. Different solutions were proposed, using complex analysis or numerical techniques. But all of these methods have their limits in usability. In this paper we present a very si...
متن کامل